package com.slx.contains_duplicate_II;

import java.util.HashMap;
import java.util.Map;

public class Solution {

    /**
     * Given an array of integers and an integer k, find out whether there there are
     * two distinct indices i and j in the array such that nums[i] = nums[j] and the
     * difference between i and j is at most k.
     * <p>
     *
     * @param nums
     * @param k
     * @return
     */
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        if (nums == null || nums.length < 2 || k < 1) {
            return false;
        }

        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (!map.containsKey(nums[i])) {
                map.put(nums[i], i);
            }
            else {
                int value = map.get(nums[i]);
                if (i - value <= k) {
                    return true;
                }
                map.put(nums[i], i);
            }
        }
        return false;
    }
}
